Comparison of R Tree, MVR Tree and TPR Tree

Naive B or B+ trees are very good and efficient for indexing single dimensional data but not well suited for multidimensional data. Antonin Guttman of University of California, Berkeley proposed a novel scheme for indexing multidimensional data called R Trees. Since then several variants of the R tree have been developed for for different situations and work loads. R tree and its variants have several applications ranging from CAD Drawings to geographical databases to mobile computing. This report summarizes the background and results of the comparison experiments performed on R Tree, MVR (Multi-Version R) Tree and the TPR (Time Parameterized R) Tree as part of the CS6400 project.